Systematic Block Markov Superposition Transmission of Repetition Codes
نویسندگان
چکیده
منابع مشابه
Block Markov Superposition Transmission of BCH Codes with Iterative Erasures-and-Errors Decoders
In this paper, we present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicte...
متن کاملUnequal Error Protection by Partial Superposition Transmission Using LDPC Codes
In this paper, we consider designing low-density parity-check (LDPC) coded modulation systems to achieve unequal error protection (UEP). We propose a new UEP approach by partial superposition transmission called UEP-by-PST. In the UEP-by-PST system, the information sequence is distinguished as two parts, the more important data (MID) and the less important data (LID), both of which are coded wi...
متن کاملGolay Complementary Codes, Double Pulse Repetition Frequency Transmission
This study concerns the development and investigation of a new composing method of short coded sequences and their transmission based on well-known Golay complementary codes and applied compression technique allowing to increase the signal-to-noise ratio (SNR) and penetration. This new method can potentially play important role in examination of superficial structures, e.g. dermatology, ophthal...
متن کاملOptimal Fractional Repetition Codes
Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded repair having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating codes, where a random set of certain size of available nodes is used for a node repair, the repairs with FR codes are table based. In this work we consider bounds on the fractional repetiti...
متن کاملBlock Codes for Asynchronous Data Transmission Designed from Binary Trees
We describe a class of codes that can be effectively used when one of qn vectors of length n has to be delivered to the receiver over a noiseless q-ary channel in asynchronous mode assuming that the latter one receives the transmitted vector with the delay τ ∈ {0, . . . , n − 1}, unknown in advance, while all other received symbols are arbitrarily chosen. The codes are specified for any n by a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2787571